Window-Games between TCP Flows
نویسندگان
چکیده
We consider network congestion problems between TCP flows and define a new game, the Window-game, whichmodels the problemsof network congestion causedby the competing flows. Analytical and experimental results show the relevance of theWindow-game to real TCP congestion games and provide interesting insight into the respective Nash equilibria. Furthermore, we propose a new algorithmic queue mechanism, called Prince, which at congestion makes a scapegoat of the most greedy flow. We provide evidence which shows that Prince achieves efficient Nash equilibria while requiring only limited computational resources. © 2010 Elsevier B.V. All rights reserved.
منابع مشابه
Analyzing the Effect of TCP and Server Population on Massively Multiplayer Games
Many Massively Multiplayer Online Role-Playing Games (MMORPGs) use TCP flows for communication between the server and the game clients. The utilization of TCP, which was not initially designed for (soft) real-time services, has many implications for the competing traffic flows. In this paper we present a series of studies which explore the competition between MMORPG and other traffic flows. For...
متن کاملGeneral AIMD Congestion Control
Instead of the increase-by-one decrease-to-half strategy used in TCP for congestion window adjustment, we consider the general case such that the increase value and decrease ratio are parameters. That is, in the congestion avoidance state, the window size is increased by per window of packets acknowledged and it is decreased to of the current value when there is congestion indication. We refer ...
متن کاملWeighted Window and Class-Based Weighted Window Methods for Per-Station TCP Fairness in IEEE 802.11 WLANs
TCP unfairness problem in access networks using the 802.11 has been studied by many researchers. Their solutions required that the existing MAC protocol be modified. However, since they did not consider the case when each wireless node has a different number of flows, they cannot provide fairness among wireless nodes having different numbers of flow in both directions. In order to resolve this ...
متن کاملEnhancements for RTT-Fair HighSpeed TCP
TCP is known to have bandwidth fairness problems for flows of different RTT. HighSpeed TCP, which adapts TCP’s congestion avoidance to grow faster, and thus be able to scale to high bandwidth environments, aggravates the RTT fairness problem since the congestion window increases at a rate proportional to the RTT and the current window size. We propose a method to eliminate the RTT fairness prob...
متن کاملA Systematic Simulation - based Study of Adverse Impact of Short - lived TCP Flows on Long - lived TCP Flows 1
UDP, can be used in attacks that capture unfairly large share of bandwidth compared to TCP flows. While earlier studies may have pointed out that short-lived TCP flows (mice) may hurt long-lived TCP flows (elephants) on the long term, no insight was given as to developing scenarios leading to drastic drop in throughputs of long-lived TCP flows. We have systematically developed TCP attack scenar...
متن کامل